Exact algorithms and bounds for the dynamic assignment interdiction problem
نویسندگان
چکیده
منابع مشابه
Exact Algorithms for a Task Assignment Problem
We consider the following task assignment problem. Communicating tasks are to be assigned to heterogeneous processors interconnected with a heterogeneous network. The objective is to minimize the total sum of the execution and communication costs. The problem is NP-hard. We present an exact algorithm based on the well-known A search. We report simulation results over a wide range of parameters ...
متن کاملExact and Heuristic Algorithms for the Weapon-Target Assignment Problem
The Weapon Target Assignment (WTA) problem is a fundamental problem arising in defense-related applications of operations research. This problem consists of optimally assigning n weapons to m targets so that the total expected survival value of the targets after all the engagements is minimum. The WTA problem can be formulated as a nonlinear integer programming problem and is known to be NP-com...
متن کاملHeuristic and exact algorithms for Generalized Bin Covering Problem
In this paper, we study the Generalized Bin Covering problem. For this problem an exact algorithm is introduced which can nd optimal solution for small scale instances. To nd a solution near optimal for large scale instances, a heuristic algorithm has been proposed. By computational experiments, the eciency of the heuristic algorithm is assessed.
متن کاملTwo exact algorithms for the generalized assignment problem
Let A = {a1, a2, . . . , as} and {b1, b2, . . . , bt} be two sets of objects with s + r = n, the generalized assignment problem assigns each element ai ∈ A to at least αi and at most α ′ i elements in B, and each element bj ∈ B to at least βj and at most β ′ j elements in A for all 1 ≤ i ≤ s and 1 ≤ j ≤ t. In this paper, we present an O(n) time and O(n) space algorithm for this problem using th...
متن کاملA Dynamic Network Interdiction Problem
We present a novel dynamic network interdiction model that accounts for interactions between an interdictor deploying resources on arcs in a digraph and an evader traversing the network from a designated source to a known terminus, wherein the agents may modify strategies in selected subsequent periods according to respective decision and implementation cycles. For the resulting minimax model, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Naval Research Logistics (NRL)
سال: 2017
ISSN: 0894-069X,1520-6750
DOI: 10.1002/nav.21753